Minmax regret maximal covering location problems with edge demands

This paper addresses a version of the single-facility Maximal Covering Location Problem on network where demand is: (i) distributed along edges and (ii) uncertain with only known interval estimation. To deal this problem, we propose minmax regret model service facility can be located anywhere network. problem is called Minmax Regret (MMR-EMCLP). Furthermore, present two polynomial algorithms for finding location that minimises maximal assuming realisation an unknown constant or linear function each edge. We also include illustrative examples as well computational study case to illustrate potential limits proposed methodology.